Hartvig Nissen og N.F.S

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Batch NFS

This paper shows, assuming standard heuristics regarding the number-field sieve, that a “batch NFS” circuit of area L factors L separate B-bit RSA keys in time L. Here L = exp((log 2)(log log 2)). The circuit’s area-time product (priceperformance ratio) is just L per key. For comparison, the best area-time product known for a single key is L. This paper also introduces new “early-abort” heurist...

متن کامل

Optimal Policy in OG Models

In the present paper general stationary overlapping generations economies with many commodities in every period and many different consumers in every generation are considered. A government maximizes a utilitarian social welfare function, which is the sum of weighted averages of utilities for generations, through fiscal policy, i.e., monetary transfers and taxes. Situations both with and withou...

متن کامل

Not Quite NFS, Soft Cache Consistency for NFS

There are some constraints inherent in the NFSTM∈ protocol that result in performance limitations for high performance workstation environments. This paper discusses an NFS-like protocol named Not Quite NFS (NQNFS), designed to address some of these limitations. This protocol provides full cache consistency during normal operation, while permitting more effective client-side caching in an effor...

متن کامل

Bigfoot - NFS : A Parallel File - Striping NFS Server ( Extended

Bigfoot-NFS allows the transparent use of the aggregate space of multiple NFS file servers as a single file system. By presenting a single apparent file system to the user, Bigfoot-NFS allows the use of available storage without the maintenance overhead of tracking multiple mounted file systems. Unlike most other network parallel file systems, Bigfoot-NFS runs without a central “metadata” serve...

متن کامل

NFS-cc: tuning NFS for concurrent read sharing

A common file access pattern found in cluster applications is concurrent read sharing: applications running on multiple sites read access the same dataset concurrently. Traditional network file systems are limited by the server’s network bandwidth; therefore cannot satisfy the high-bandwidth concurrent reads that cluster applications typically require. This paper presents NFS-cc: a cooperative ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Teologisk tidsskrift

سال: 2019

ISSN: 1893-0271,1893-0263

DOI: 10.18261/issn.1893-0271-2019-02-04